YES 0.8270000000000001
↳ HASKELL
↳ LR
((eltsFM_LE :: FiniteMap () a -> () -> [a]) :: FiniteMap () a -> () -> [a]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||||||||||||
eltsFM_LE :: Ord b => FiniteMap b a -> b -> [a]
|
|||||||||||||||||||
foldFM_LE :: Ord c => (c -> a -> b -> b) -> b -> c -> FiniteMap c a -> b
|
import qualified FiniteMap import qualified Prelude |
\keyeltrest→elt : rest
eltsFM_LE0 key elt rest = elt : rest
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
((eltsFM_LE :: FiniteMap () a -> () -> [a]) :: FiniteMap () a -> () -> [a]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||||||||||||
eltsFM_LE :: Ord a => FiniteMap a b -> a -> [b]
|
|||||||||||||||||||
|
|||||||||||||||||||
foldFM_LE :: Ord c => (c -> b -> a -> a) -> a -> c -> FiniteMap c b -> a
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((eltsFM_LE :: FiniteMap () a -> () -> [a]) :: FiniteMap () a -> () -> [a]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||||||||||||
eltsFM_LE :: Ord a => FiniteMap a b -> a -> [b]
|
|||||||||||||||||||
|
|||||||||||||||||||
foldFM_LE :: Ord c => (c -> b -> a -> a) -> a -> c -> FiniteMap c b -> a
|
import qualified FiniteMap import qualified Prelude |
foldFM_LE k z fr EmptyFM = z foldFM_LE k z fr (Branch key elt vw fm_l fm_r)
| key <= fr
= foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r | otherwise
= foldFM_LE k z fr fm_l
foldFM_LE k z fr EmptyFM = foldFM_LE3 k z fr EmptyFM foldFM_LE k z fr (Branch key elt vw fm_l fm_r) = foldFM_LE2 k z fr (Branch key elt vw fm_l fm_r)
foldFM_LE0 k z fr key elt vw fm_l fm_r True = foldFM_LE k z fr fm_l
foldFM_LE1 k z fr key elt vw fm_l fm_r True = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r foldFM_LE1 k z fr key elt vw fm_l fm_r False = foldFM_LE0 k z fr key elt vw fm_l fm_r otherwise
foldFM_LE2 k z fr (Branch key elt vw fm_l fm_r) = foldFM_LE1 k z fr key elt vw fm_l fm_r (key <= fr)
foldFM_LE3 k z fr EmptyFM = z foldFM_LE3 wv ww wx wy = foldFM_LE2 wv ww wx wy
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
(eltsFM_LE :: FiniteMap () a -> () -> [a]) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||
eltsFM_LE :: Ord b => FiniteMap b a -> b -> [a]
|
|||||||||
|
|||||||||
foldFM_LE :: Ord a => (a -> c -> b -> b) -> b -> a -> FiniteMap a c -> b
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
new_foldFM_LE1(wz6, @0, wz341, wz342, wz343, wz344, h) → new_foldFM_LE(wz341, new_foldFM_LE0(wz6, wz343, h), wz344, h)
new_foldFM_LE1(wz6, @0, wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, h) → new_foldFM_LE1(wz6, wz3430, wz3431, wz3432, wz3433, wz3434, h)
new_foldFM_LE(wz31, wz5, Branch(wz340, wz341, wz342, wz343, wz344), h) → new_foldFM_LE1(new_eltsFM_LE0(wz31, wz5, h), wz340, wz341, wz342, wz343, wz344, h)
new_foldFM_LE2(wz31, wz5, Branch(wz340, wz341, wz342, wz343, wz344), h) → new_foldFM_LE10(new_eltsFM_LE0(wz31, wz5, h), wz340, wz341, wz342, wz343, wz344, h)
new_foldFM_LE10(wz6, @0, wz341, wz342, wz343, wz344, h) → new_foldFM_LE2(wz341, new_foldFM_LE0(wz6, wz343, h), wz344, h)
new_foldFM_LE2(wz31, wz5, EmptyFM, h) → new_eltsFM_LE0(wz31, wz5, h)
new_eltsFM_LE0(wz31, wz5, h) → :(wz31, wz5)
new_foldFM_LE0(wz6, EmptyFM, h) → wz6
new_foldFM_LE0(wz6, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), h) → new_foldFM_LE10(wz6, wz3430, wz3431, wz3432, wz3433, wz3434, h)
new_foldFM_LE2(x0, x1, EmptyFM, x2)
new_foldFM_LE0(x0, EmptyFM, x1)
new_foldFM_LE0(x0, Branch(x1, x2, x3, x4, x5), x6)
new_foldFM_LE2(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
new_foldFM_LE10(x0, @0, x1, x2, x3, x4, x5)
new_eltsFM_LE0(x0, x1, x2)
From the DPs we obtained the following set of size-change graphs:
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
new_foldFM_LE3(@0, Branch(@0, wz31, wz32, wz33, wz34), h) → new_foldFM_LE3(@0, wz33, h)
From the DPs we obtained the following set of size-change graphs: